Scheduling a Bounded Parallel-Batching Machine with Incompatible Job Families and Rejection
نویسندگان
چکیده
منابع مشابه
Algorithms for scheduling incompatible job families on single batching machine with limited capacity
Article history: Received 3 May 2012 Received in revised form 21 February 2013 Accepted 20 June 2014 Available online 30 June 2014
متن کاملHeuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent de...
متن کاملScheduling a Batching Machine
We address the problem of scheduling n jobs on a batching machine to minimize regular scheduling criteria that are non-decreasing in the job completion times. A batching machine is a machine that can handle up to b jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is equal to the la...
متن کاملBounded single-machine parallel-batch scheduling with release dates and rejection
We consider the bounded single-machine parallel-batch scheduling problem with release dates and rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and then processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. When the jobs have identical release dates, we pres...
متن کاملTwo-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
We schedule the jobs from two agents on a single parallel-batching machine with equal processing time and non-identical job sizes. The objective is to minimize the makespan of the first agent subject to an upper bound on the makespan of the other agent. We show that there is no polynomial-time approximation algorithm for solving this problem with a finite worst-case ratio, unless P = NP. Then, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2014
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-014-0062-y